A univariate resultant-based implicitization algorithm for surfaces
نویسندگان
چکیده
منابع مشابه
A perturbed differential resultant based implicitization algorithm for linear DPPEs
Let K be an ordinary differential field with derivation ∂. Let P be a system of n linear differential polynomial parametric equations in n− 1 differential parameters with implicit ideal ID. Given a nonzero linear differential polynomial A in ID we give necessary and sufficient conditions on A for P to be n − 1 dimensional. We prove the existence of a linear perturbation Pφ of P so that the line...
متن کاملImplicitization using univariate resultants
Among several implicitization methods, the method based on resultant computation is a simple and direct one, but it often brings extraneous factors which are difficult to remove. This paper studies a class of rational space curves and rational surfaces by implicitization with univariate resultant computations. This method is more efficient than the other algorithms in finding implicit equations...
متن کاملAn Implicitization Algorithm for Rational Surfaces with no Base Points
The computation of the implicit equation of a rational parametric surface is in many applications the first step to deal with. The different methods of implicitization belong to two main classes. The first class of methods relies on classical elimination theory. Iterated resultants in one variable or resultants in several variables are used to compute the implicit form. The computation of the r...
متن کاملThe Univariate Discriminant via the Sylvester Resultant
Remark 1.2 The Fundamental Theorem of Algebra enters in the very last inequality: the fact that having d distinct roots implies that Res(d,d−1)(f, f ) 6= 0. Later we will see a refinement of the above theorem giving a positive lower bound even when Res(d,d−1)(f, f )=0. ⋄ A key result we’ll need is the following algebraic identity. Lemma 1.3 Following the notation of Theorem 1.1, we have Res(d,d...
متن کاملImplicitization of Rational Parametric Surfaces
A generalized projective implicitization theorem is presented that can be used to solve the implicitization of rational parametric curves and surfaces in an affine space. The Groebner bases technique is used to implement the algorithm. The algorithm has the advantages that it can handle base points in a parametrization, and no extra factors will be introduced into an implicit equation. The comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2008
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2007.10.001